A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
نویسندگان
چکیده
منابع مشابه
Monotonic convergence of a general algorithm for computing optimal designs
Monotonic convergence is established for a general class of multiplicative algorithms introduced by Silvey et al. (1978) for computing optimal designs. A conjecture of Titterington (1978) is confirmed as a consequence. Optimal designs for logistic regression are used as an illustration.
متن کاملOn a Multiplicative Algorithm for Computing Bayesian D-optimal Designs
We use the minorization-maximization principle (Lange, Hunter and Yang 2000) to establish the monotonicity of a multiplicative algorithm for computing Bayesian D-optimal designs. This proves a conjecture of Dette, Pepelyshev and Zhigljavsky (2008). We also study a nearest neighbor exchange strategy and show that it can dramatically improve the speed of the multiplicative algorithm.
متن کامل’Optimal’ Randomized Designs for Sequential Experiments with Two Treatments
This paper starts with a discussion of the ’optimality’ of sequential randomized designs for comparing two treatments and introduces the concept of “desirable” proportion of allocations to one of the treatments. The problem is finding a randomized design which converges to the desirable one almost certainly and also forces the procedure towards the desirable proportion even for small samples. W...
متن کاملThe Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملOptimal designs for conjoint experiments
In conjoint experiments, each respondent receives a set of profiles to rate. Sometimes, the profiles are expensive prototypes that respondents have to test before rating them. Designing these experiments involves determining how many and which profiles each respondent has to rate and how many respondents are needed. To that end, the set of profiles offered to a respondent is treated as a separa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 2019
ISSN: 0162-1459,1537-274X
DOI: 10.1080/01621459.2018.1546588